全文获取类型
收费全文 | 7465篇 |
免费 | 358篇 |
国内免费 | 398篇 |
专业分类
化学 | 938篇 |
晶体学 | 47篇 |
力学 | 732篇 |
综合类 | 16篇 |
数学 | 3959篇 |
物理学 | 2529篇 |
出版年
2024年 | 6篇 |
2023年 | 89篇 |
2022年 | 116篇 |
2021年 | 157篇 |
2020年 | 177篇 |
2019年 | 140篇 |
2018年 | 149篇 |
2017年 | 177篇 |
2016年 | 187篇 |
2015年 | 177篇 |
2014年 | 433篇 |
2013年 | 611篇 |
2012年 | 361篇 |
2011年 | 542篇 |
2010年 | 446篇 |
2009年 | 487篇 |
2008年 | 539篇 |
2007年 | 555篇 |
2006年 | 344篇 |
2005年 | 252篇 |
2004年 | 251篇 |
2003年 | 237篇 |
2002年 | 193篇 |
2001年 | 156篇 |
2000年 | 185篇 |
1999年 | 154篇 |
1998年 | 134篇 |
1997年 | 128篇 |
1996年 | 108篇 |
1995年 | 115篇 |
1994年 | 88篇 |
1993年 | 61篇 |
1992年 | 47篇 |
1991年 | 26篇 |
1990年 | 33篇 |
1989年 | 23篇 |
1988年 | 19篇 |
1987年 | 20篇 |
1986年 | 30篇 |
1985年 | 33篇 |
1984年 | 31篇 |
1983年 | 25篇 |
1982年 | 25篇 |
1981年 | 26篇 |
1980年 | 36篇 |
1979年 | 35篇 |
1978年 | 22篇 |
1977年 | 21篇 |
1976年 | 7篇 |
1974年 | 2篇 |
排序方式: 共有8221条查询结果,搜索用时 15 毫秒
991.
聚硅烷—类崭新的非线性光学材料 总被引:4,自引:0,他引:4
本文重点介绍了聚硅烷这类崭新的非线性光学材料,评述了其优点、研究现状、影响其三阶非线性光学特性的因素以及未来的发展方向. 相似文献
992.
The use of non-contact laser techniques for the generation of ultrasound has extended the limits of the application of traditional ultrasonic techniques. This paper focusses on the use of one such non-contact laser technique, known as ‘optical fibre array’, to generate shear and surface waves. The shear wave experimental directivity pattern results are presented and compared with the theoretical results of a single source and an array source. The experimental directivity results for the surface wave are also presented, and compared with the theoretical results. The data show that the array enhances signal generation in the forward direction for both shear and surface waves. The array gain is also discussed. The receiver for the directivity measurements was a contact piezoelectric transducer. 相似文献
993.
994.
Fern Sassower Sisser 《Mathematical Programming》1981,20(1):110-121
The problem of minimizing a nonlinear objective function ofn variables, with continuous first and second partial derivatives, subject to nonnegativity constraints or upper and lower bounds on the variables is studied. The advisability of solving such a constrained optimization problem by making a suitable transformation of its variables in order to change the problem into one of unconstrained minimization is considered. A set of conditions which guarantees that every local minimum of the new unconstrained problem also satisfies the first-order necessary (Kuhn—Tucker) conditions for a local minimum of the original constrained problem is developed. It is shown that there are certain conditions under which the transformed objective function will maintain the convexity of the original objective function in a neighborhood of the solution. A modification of the method of transformations which moves away from extraneous stationary points is introduced and conditions under which the method generates a sequence of points which converges to the solution at a superlinear rate are given. 相似文献
995.
996.
997.
998.
P. T. Liu 《Journal of Optimization Theory and Applications》1979,27(4):539-547
In this paper, two linear-quadratic systems are shown to be asymptotically decoupled. We obtain the steady-state term and the first-order transient term of optimal controls. We also obtain an estimate of the rate at which the first-order transient term diminishes and approaches zero. 相似文献
999.
Layne T. Watson 《Mathematical Programming》1980,19(1):92-101
The Chow—Yorke algorithm is a nonsimplicial homotopy type method for computing Brouwer fixed points that is globally convergent. It is efficient and accurate for fixed point problems. L.T. Watson, T.Y. Li, and C.Y. Wang have adapted the method for zero finding problems, the nonlinear complementarity problem, and nonlinear two-point boundary value problems. Here theoretical justification is given for applying the method to some mathematical programming problems, and computational results are presented.This work was partially supported by NSF Grant MCS 7821337. 相似文献
1000.
S. T. Glad 《Journal of Optimization Theory and Applications》1979,28(2):135-156
The convergence properties of different updating methods for the multipliers in augmented Lagrangians are considered. It is assumed that the updating of the multipliers takes place after each line search of a quasi-Newton method. Two of the updating methods are shown to be linearly convergent locally, while a third method has superlinear convergence locally. Modifications of the algorithms to ensure global convergence are considered. The results of a computational comparison with other methods are presented.This work was supported by the Swedish Institute of Applied Mathematics. 相似文献